A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme
نویسندگان
چکیده
The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Zn, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Zn with respect to the polynomial-time many-one reducibility. key words: key exchange scheme, Okamoto-Tanaka, DiffieHellman, RSA, reducibility
منابع مشابه
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie–Hellman problem or the discrete logarithm problem. The security of the scheme relies on the difficulty to solve three problems related to the Diffie–Hellman problem and a one-way isomorphism.
متن کاملOptimal SVD-based Precoding for Secret Key Extraction from Correlated OFDM Sub-Channels
Secret key extraction is a crucial issue in physical layer security and a less complex and, at the same time, a more robust scheme for the next generation of 5G and beyond. Unlike previous works on this topic, in which Orthogonal Frequency Division Multiplexing (OFDM) sub-channels were considered to be independent, the effect of correlation between sub-channels on the secret key rate is address...
متن کاملID-Based Group Password-Authenticated Key Exchange
Password-authenticated key exchange (PAKE) protocols are designed to be se-cure even when the secret key used for authentication is a human-memorable password. In thispaper, we consider PAKE protocols in the group scenario, in which a group of clients, each ofthem shares a password with an “honest but curious” server, intend to establish a common secretkey (i.e., a group key) wi...
متن کاملA novel key management scheme for heterogeneous sensor networks based on the position of nodes
Wireless sensor networks (WSNs) have many applications in the areas of commercial, military and environmental requirements. Regarding the deployment of low cost sensor nodes with restricted energy resources, these networks face a lot of security challenges. A basic approach for preparing a secure wireless communication in WSNs, is to propose an efficient cryptographic key management protocol be...
متن کاملCryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves
In 1997, H. Sakazaki, E. Okamato and M. Mambo [4] proposed an ID-based key distribution system on an elliptic curve over Zn. We will cryptanalyze the scheme and demonstrate that when the hashed ID length is about 160 bits, the scheme is insecure. To be specific, after requesting a small number of keys from the Center, our attack allows a new valid key to be constructed without any further inter...
متن کامل